Course Codes

نویسندگان

چکیده

No abstract available.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Optimal Codes From Designs

The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.

متن کامل

Visual letter-matching and the time course of visual and acoustic codes.

Two experiments on visual letter-matching have been widely cited in the literature as Indicating a role of acoustic codes in such tasks. Posner and Mitchell (1967) concluded that a visual code is sufficient to compare two identical letters (e.g.. AA), whereas a slower forming acoustic code is required to compare nonidentical letters, whether with the same name (e.g.. Aa) or with different names...

متن کامل

Effect of uncertainty on the time course for selection of verbal name codes.

Response selection takes time. Hick's law (Hick, 1952) predicts that the time course of response selection is a logarithmic function of the number of equally likely response alternatives. However, recent work has shown that oculomotor responses constitute noteworthy exceptions in that the latencies of saccades (Kveraga, Boucher, & Hughes, 2002) and smooth pursuit movements (Berryhill, Kveraga, ...

متن کامل

Isotropic Constant Dimension Subspace Codes

 In network code setting, a constant dimension code is a set of k-dimensional subspaces of F nq . If F_q n is a nondegenerated symlectic vector space with bilinear form f, an isotropic subspace U of F n q is a subspace that for all x, y ∈ U, f(x, y) = 0. We introduce isotropic subspace codes simply as a set of isotropic subspaces and show how the isotropic property use in decoding process, then...

متن کامل

One-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes

We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Inroads

سال: 2023

ISSN: ['2153-2184', '2153-2192']

DOI: https://doi.org/10.1145/3596919